On the training distortion of vector quantizers
نویسنده
چکیده
The in-training-set performance of a vector quantizer as a function of its training set size is investigated. For squared error distortion and independent training data, worst case type upper bounds are derived on the minimum training distortion achieved by an empirically optimal quantizer. These bounds show that the training distortion can underestimate the minimum distortion of a truly optimal quantizer by as much as a constant times , where is the size of the training data. Earlier results provide lower bounds of the same order.
منابع مشابه
Recursive partitioning to reduce distortion
Adaptive partitioning of a multidimensional feature space plays a fundamental role in the design of data-compression schemes. Most partition-based design methods operate in an iterative fashion, seeking to reduce distortion at each stage of their operation by implementing a linear split of a selected cell. The operation and eventual outcome of such methods is easily described in terms of binary...
متن کاملSample-adaptive product quantization: asymptotic analysis and examples
Vector quantization (VQ) is an efficient data compression technique for low bit rate applications. However, the major disadvantage of VQ is that its encoding complexity increases dramatically with bit rate and vector dimension. Even though one can use a modified VQ, such as the tree-structured VQ, to reduce the encoding complexity, it is practically infeasible to implement such a VQ at a high b...
متن کاملA genetic approach to the design of general-tree-structured vector quantizers for speech coding
The full-search vector quantization suffers from spending much time searching the whole codebook sequentially. Rcccntly, several tree-structured vector quantizers had been proposed. But almost all trees used arc binary trees and hence the training samples contained in each node are forced to be divided into two clusters artificially. We present a general-tree-structured vector quantizer that is...
متن کاملAn algorithm for uniform vector quantizer design
A vector quantizer maps a k-dimensional vector into one of a finite set of output vectors or “points”. Although certain lattices have been shown to have desirable properties for vector quantization applications, there are as yet no algorithms available in the quantization literature for building quantizers based on these lattices. An algorithm for designing vector quantizers based on the root l...
متن کاملA Vector Quantization Approach to Universal Noiseless Coding and Quantization - Information Theory, IEEE Transactions on
A two-stage code is a block code in which each block of data is coded in two stages: the first stage codes the identity of a block code among a collection of codes, and the second stage codes the data using the identified code. The collection of codes may he noiseless codes, fixed-rate quantizers, or variable-rate quantizers. We take a vector quantization approach to twostage coding, in which t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 46 شماره
صفحات -
تاریخ انتشار 2000